Tableaus and Automata for Description Logics
نویسنده
چکیده
In this paper, we briefly present three different approaches at examining the relation between tableaus and automata, and possibly combining their advantages in the context of testing satisfiability of description logic concepts. The first approach tries to transfer the efficiency of tableaus to automata by performing the automata emptiness test with a tableau algorithm. The second one examines conditions which allow for obtaining PSpace complexity results from automata algorithms. The third one defines an abstract framework for tableau algorithms hat makes it possible to derive from an algorithm formalised within this framework both an ExpTime automata algorithm and a terminating and practically efficient tableau algorithm.
منابع مشابه
Discrete Tableau Algorithms for FSHI
A variety of fuzzy description logics are proposed to extend classical description logics with fuzzy capability. However, reasoning with general TBoxes is still an open problem in fuzzy description logics. In this paper, we present a novel discrete tableau algorithm for a given fuzzy description logic FSHI with general TBoxes, which tries to construct discrete tableaus of FSHI knowledge bases. ...
متن کاملPSPACE Automata for Description Logics
Tree automata are often used for satisfiability testing in the area of description logics, which usually yields ExpTime complexity results. We examine conditions under which this result can be improved, and we define two classes of automata, called segmentable and weakly-segmentable, for which emptiness can be decided using space logarithmic in the size of the automaton (and thus polynomial in ...
متن کاملReasoning in Fuzzy Description Logics using Automata
Automata-based methods have been successfully employed to prove tight complexity bounds for reasoning in many classical logics, and in particular in Description Logics (DLs). Very recently, the ideas behind these automata-based approaches were adapted for reasoning also in fuzzy extensions of DLs, with semantics based either on finitely many truth degrees or the Gödel t-norm over the interval [...
متن کاملPrefixed tableaus and nested sequents
Nested sequent systems for modal logics are a relatively recent development, within the general area known as deep reasoning. The idea of deep reasoning is to create systems within which one operates at lower levels in formulas than just those involving the main connective or operator. Prefixed tableaus go back to 1972, and are modal tableau systems with extra machinery to represent accessibili...
متن کامل